computation modelの例文

• Since then, this abstract computation model found applications in robotics and chemistry.
• The evolutionary-computation model of creativity views random stimulus creativity techniques as mutation operators.
• In 1960 Christy turned his attention to astrophysics, creating some of the first practical computation models of stellar operation.
• The following table uses the evolutionary computation model to describe four classes of computation, three of which rely on humans in some role.
• The computation model of universal composability is that of interactive Turing machines that can activate each other by writing on each other's communication tapes.
• It is good for the non-premixed combustion but for the premixed flames the reactant will burn at the moment they enter in the computation model, which is incorrect.
• The STL was created as the first library of generic algorithms and data structures for C + +, with four ideas in mind : generic programming, Von Neumann computation model, and value semantics.
• In spite of this a computation model was found that could still use these mixed states for computation, however the more mixed these states are the weaker the induction signal corresponding to a quantum measurement.
• Because Turing machines have the ability to " back up " in their input tape, it is possible for a Turing machine to run for a long time in a way that is not possible with the other computation models previously described.
• In the other direction, it helps to verify the complexity of a computation model; the decision problem for a ( deterministic ) model whose configuration are of space which is logarithmic in the size of the input is in ( NL . This is for example the case of finite automata and finite automata with one counter.
• The inclusion into Class I does not require the simplicity of the assumed computation model, as some testing cases involving implementations written in any programming language, and testing implementations defined as machines depending on continuous magnitudes, have been proved to be in Class I . Other elaborated cases, such as the testing framework by Matthew Hennessy under must semantics, and temporal machines with rational timeouts, belong to Class II.